On min–max r-gatherings

On r-Gatherings on the Line

Given an integer r, a set C of customers, a set F of facilities, and a connecting cost co(c, f) for each pair of c ∈ C and f ∈ F , an r-gathering of customers C to facilities F is an assignment A of C to open facilities F ′ ⊂ F such that r or more customers are assigned to each open facility. We wish to find an r-gathering with the minimum cost, where the cost is maxci∈C{co(ci, A(ci))}. When al...

Mass gatherings and mass gatherings health

[No Abstract Available].

Jeddah declaration on mass gatherings health.

Function template std : : minmax and / or algorithm std : : minmax _ element

This proposal adds a function template (std::minmax) and / or an algorithm (std::minmax_element) to the header , both of which are implicitly present (by two separate calls to std::min and std::max, or std::min_element and std::max_element), but admit a better implementation if the two calls are combined into one. Both additions can be considered independently, although they are stro...

On minmax theorems for multiplayer games Citation

We prove a generalization of von Neumann’s minmax theorem to the class of separable multiplayer zerosum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix—that is, graphical games in which every edge is a two-player game between its endpoints—in which every outcome has zero total sum of players’ payoffs. Our generalization of the minmax theorem implies convexity of equili...